Lattice Embeddings in Percolation
نویسنده
چکیده
Does there exist a Lipschitz injection of Z into the open set of a site percolation process on Z, if the percolation parameter p is sufficiently close to 1? We prove a negative answer when d = D, and also when d ≥ 2 if the Lipschitz constant M is required to be 1. Earlier work of Dirr, Dondl, Grimmett, Holroyd, and Scheutzow yields a positive answer for d < D and M = 2. As a result, the above question is answered for all d, D and M . Our proof in the case d = D uses Tucker’s Lemma from topological combinatorics, together with the aforementioned result for d < D. One application is an affirmative answer to a question of Peled concerning embeddings of random words in two and more dimensions.
منابع مشابه
A classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملLattice-based structures for studying percolation in two-dimensional grain networks
The applicability of standard lattice percolation models to a random two-dimensional grain structure is explored. A random network based on the triangle lattice is proposed as a more appropriate model, and results in a higher percolation threshold (0.711 compared with 0.653 for the standard hexagonal lattice). The triple junction constraint inherent in grain boundary structures is subsequently ...
متن کاملDetermination of the bond percolation threshold for the Kagomé lattice
The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagomé lattice (and its dual, the dice lattice). For this system, the hull walk is represented as a self-avoiding trail, or mirror-model trajectory, on the (3,4,6,4)-Archimedean tiling lattice. The result pc = 0.524 4053 ± 0.000 0003 (one standard deviation of error) is not consisten...
متن کاملBond percolation on isoradial graphs: Criticality and universality
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملBond Percolation on Isoradial Graphs
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010